Simple fast and adaptive lossless image compression algorithm

Simple fast and adaptive lossless image compression algorithm

In this paper we present a new lossless image compression algorithm. To achieve the high compression speed we use a linear prediction, modified Golomb–Rice code family, and a very fast prediction error modeling method. We compare the algorithm experimentally with others for medical and natural continuous tone grayscale images of depths of up to 16 bits. Its results are especially good for big i...

Fast Lossless Image Compression

In this paper, we present a simple algorithm for fast lossless compression of grayscale images. It consists of Diierential Pulse Code Modulation (DPCM) followed by Huuman coding of the most-likely residual magnitudes. Our tests show that it attains higher compression with less computation than the Lossless JPEG method. For the large dynamic ranges possible with pixel sizes greater than 8-bits, ...

FLIC: Fast & Lossless Image Compression Algorithm for Hyper-Spectral Images

Adaptive filter banks for lossless image compression

A subband decomposition based lossless image compression algorithm based on adaptive is described. The decomposition is achieved by a two-channel adaptive filter bank. The resulting coefficients are lossy coded first, and th en the residual error between the lossy and error free coefficients are compressed. The locations and the magnitudes of the nonzero coefficients are encoded separately by a...

Adaptive Lossless Prediction based Image Compression

Predictive methods of image compression traditionally visit the pixels to be compressed in raster scan order, making a prediction for that pixel and storing the difference between the pixel and its prediction. We introduce a new predictive lossless compression method in which the order in which the pixels are visited is determined using a predictor based on previously known pixel values. This m...